Languages Modulo Normalization

نویسندگان

  • Hitoshi Ohsaki
  • Hiroyuki Seki
چکیده

We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them: recognized tree languages modulo the idempotency f(x, x) = x are closed under complement, besides we do not lose an important decidability result. In the paper, first we investigate the closure properties of this class for Boolean operations and the decidability relative to the equational tree automata. Next we consider the relationship to other automata frameworks, in particular, hedge automata, which is a class of unranked tree automata. Hedge automata have been recognized in the XML database community as a theoretical basis for modeling the manipulation of semi-structured data. Through the observation about transformations from XML schema to tree automata, we discuss advantages in the expressiveness and complexity of TAN. As an application of our framework, we show an example of XML schema and constraints that can be dealt with by TAN.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Normalization in Supernatural deduction and in Deduction modulo

Deduction modulo and Supernatural deduction are two extentions of predicate logic with computation rules. Whereas the application of computation rules in deduction modulo is transparent, these rules are used to build non-logical deduction rules in Supernatural deduction. In both cases, adding computation rules may jeopardize proof normalization, but various conditions have been given in both ca...

متن کامل

Typeful Normalization by Evaluation

We present the first typeful implementation of Normalization by Evaluation for the simply typed λ-calculus with sums and control operators: we guarantee type preservation and η-long (modulo commuting conversions), β-normal forms using only Generalized Algebraic Data Types in a general-purpose programming language, here OCaml; and we account for finite sums and control operators with Continuatio...

متن کامل

A Semantic Normalization Proof for System T

Semantics methods have been used to prove cut elimination theorems for a long time. It is only recently that they have been extended to prove strong normalization results. For instance using the notion of super-consistency that is a semantic criterion for theories expressed in deduction modulo implying strong normalization. However, the strong normalization of System T has always been reluctant...

متن کامل

The Stratiied Foundations as a Theory Modulo

The Stratiied Foundations are a restriction of naive set theory where the comprehension scheme is restricted to stratiiable propositions. It is known that this theory is consistent and that proofs strongly normalize in this theory. Deduction modulo is a formulation of rst-order logic with a general notion of cut. It is known that proofs normalize in a theory modulo if it has some kind of many-v...

متن کامل

A Semantic Normalization Proof for Inductive Types

Semantics methods have been used to prove cut elimination theorems for a long time. It is only recently that they have been extended to prove strong normalization results. For instance using the notion of super-consistency that is a semantic criterion for theories expressed in deduction modulo implying strong normalization. However, the strong normalization of System T has always been reluctant...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007